Characteristic Formulae for Relations with Nested Fixed Points
نویسندگان
چکیده
A general framework for the connection between characteristic formulae and behavioral semantics is described in [2]. This approach does not suitably cover semantics defined by nested fixed points, such as the n-nested simulation semantics for n greater than 2. In this study we address this deficiency and give a description of nested fixed points that extends the approach for single fixed points in an intuitive and comprehensive way.
منابع مشابه
Characteristic Formulae for Fixed-Point Semantics: A General Framework
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. This ...
متن کاملA General Framework for Probabilistic Characterizing Formulae
Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae of many non-probabilistic behavioral relations. Our paper studies their techniques in a probabilistic setting. We provide a general method for determining characteristic formulae of behavioral relations for probabilistic automat...
متن کاملDerivation of Characteristic Formulae
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation case and, by virtue of derivation, immediately generalizes to various other bisimulation-like rel...
متن کاملExplorer Regular Languages of Nested Words : Fixed Points , Automata , and Synchronization
Nested words provide a natural model of runs of programs with recursive procedure calls. The usual connection between monadic second-order logic (MSO) and automata extends from words to nested words and gives us a natural notion of regular languages of nested words. In this paper we look at some well-known aspects of regular languages – their characterization via fixed points, deterministic and...
متن کاملFixed Fuzzy Points of Fuzzy Mappings in Hausdorff Fuzzy Metric Spaces with Application
Recently, Phiangsungnoen et al. [J. Inequal. Appl. 2014:201 (2014)] studied fuzzy mappings in the framework of Hausdorff fuzzy metric spaces.Following this direction of research, we establish the existence of fixed fuzzy points of fuzzy mappings. An example is given to support the result proved herein; we also present a coincidence and common fuzzy point result. Finally, as an application of ou...
متن کامل